A parse tree is often the output of a {[parser}}. It typically follows the grammar of the underlying natural language or formal notation, with higher level nodes tagged with non-terminal symbols of the grammar and leaves tagged with terminal symbols and connected to actual words in the text. In a formal gramer, such as for programming language a mathematical formulae, the parse tree may be executes or evaluated dircetly by an interpreter or compiled into lower-level code or later execution.
Used on pages 289, 290, 293, 295, 298
Parse tree for the query "Who belongs to a union?"
Parse tree for the query "Does Sam Smith work in the IT Department?"